Privacy preserving information retrieval over unsynchronized databases
نویسندگان
چکیده
منابع مشابه
Report on Private Information Retrieval over Unsynchronized Databases
There are many challenges concerning online privacy. Private information retrieval (PIR) tries to find solution to following problem. Server has a database of n records and client wants to retrieve w-th record without revealing w to the server. PIR schemes can be described for single-server and multi-server case (where each server holds identical copy of database). Current report reviews a mult...
متن کاملPrivacy-Preserving Queries over Relational Databases
We explore how Private Information Retrieval (PIR) can help users keep their sensitive information from being leaked in an SQL query. We show how to retrieve data from a relational database with PIR by hiding sensitive constants contained in the predicates of a query. Experimental results and microbenchmarking tests show our approach incurs reasonable storage overhead for the added privacy bene...
متن کاملPreserving Access Privacy Over Large Databases
Anonymity systems preserve the identities of users as they access Internet data sources. The security of many such systems, such as Tor, relies on a model where the adversary does not have a global view or control of the network. A different problem is that of preserving access privacy for users accessing a large database over the Internet in a model where the adversary has full control of the ...
متن کاملH(k)-private Information Retrieval from Privacy-uncooperative Queryable Databases.">h(k)-private Information Retrieval from Privacy-uncooperative Queryable Databases
Purpose – This paper aims to address the privacy problem associated with the use of internet search engines. The purpose of the paper is to propose and validate a set of methods and protocols to guarantee the privacy of users’ queries. Design/methodology/approach – In this paper h(k)-private information retrieval (h(k)-PIR) is defined as a practical compromise between computational efficiency a...
متن کاملSupporting Information for Privacy-preserving search for chemical compound databases
For self-containment, we briefly recall the lifted ElGamal encryption scheme with the non-interactive zero-knowledge proof (NIZK) system which proves that the plaintext is either 0 or 1, proposed in [1], and provide some intuition for it. Let G be a group of prime order p such that the Decisional DiffieHellman assumption holds (i.e., the resulting encryption scheme provides a standard security ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Cybernetics & Informatics
سال: 2016
ISSN: 2320-8430,2277-548X
DOI: 10.5121/ijci.2016.5226